Toward an Automatically Tuned Dense Symmetric Eigensolver for Shared Memory Machines
نویسنده
چکیده
Computation of eigenvalues and eigenvectors of a dense symmetric matrix is one of the most important problems in numerical linear algebra. In applications such as molecular orbital methods and first-principles molecular dynamics, eigensolution of matrices of order more than 10,000 is now needed. One of the approaches to solve such a large problem in practical time is to use symmetric multi-processors (SMPs). To exploit the potential high performance of SMP machines, one has to consider two issues, namely, (i) minimizing the number of inter-processor synchronizations and (ii) utilize the cache memory efficiently, thereby avoiding memory access conflict among the processors.
منابع مشابه
Toward High Performance Divide and Conquer Eigensolver for Dense Symmetric Matrices
This paper presents a high performance eigensolver for dense symmetric matrices on multicore architectures. Based on the well-known divide and conquer (D&C) methodology introduced by Cuppen, this algorithm computes all the eigenvalues of the symmetric matrix. The general D&C can be expressed in three stages: (1) Partitioning into subproblems, (2) Computing the solution of the subproblems and (3...
متن کاملTridiagonalization of a dense symmetric matrix on multiple GPUs and its application to symmetric eigenvalue problems
For software to fully exploit the computing power of emerging heterogeneous computers, not only must the required computational kernels be optimized for the specific hardware architectures but also an effective scheduling scheme is needed to utilize the available heterogeneous computational units and to hide the communication between them. As a case study, we develop a static scheduling scheme ...
متن کاملNumerical Library Eigensolver Performance on PRACE Tier-0 Systems
Parallel eigensolver operations are at the computational core of many large-scale scientific and engineering application codes. This project analyses parallel performance of established and newly developed parallel dense symmetric eigensolver numerical library routines on PRACE Tier-0 systems using real datasets from large-scale application codes. This whitepaper builds upon the research report...
متن کاملParallel Implementation of a Symmetric Eigensolver Based on the Yau and Lu Method
In this paper, we present preliminary results on a complete eigensolver based on the Yau and Lu method. We rst give an overview of this invariant subspace decomposition method for dense symmetric matrices followed by numerical results and work in progress of a distributed-memory implementation. We expect that the algorithm's heavy reliance on matrix-matrix multiplication, coupled with FFT shoul...
متن کاملA Massively Parallel Dense Symmetric Eigensolver with Communication Splitting Multicasting Algorithm
1 Information Technology Center, The University of Tokyo, 2-11-16 Yayoi, Bunkyo-ku, Tokyo 113-8658, JAPAN [email protected] 2 Advanced Center for Computing and Communication, RIKEN, 2-1 Hirosawa, Wako-shi, Saitama 351-0198, JAPAN [email protected] Abstract. In this paper, we propose a process grid free algorithm for a massively parallel dense symmetric eigensolver with a communication spl...
متن کامل